Permission Based Group Mutual Exclusion Algorithms for a Cluster Tree Network
نویسندگان
چکیده
منابع مشابه
A survey of permission-based distributed mutual exclusion algorithms
The problem of mutual exclusion in distributed systems has attracted considerable attention over the last two decades. The mutual exclusion problem requires that, at a time, only one of the contending processes be allowed to enter its critical section (CS). A number of solutions have been provided to the mutual exclusion problem in distributed systems. Different algorithms have used different t...
متن کاملCluster Based Distributed Mutual Exclusion Algorithms for Mobile Networks
We propose an architecture that consists of a ring of clusters for distributed mutual exclusion algorithms in mobile networks. The mobile network is partitioned into a number of clusters periodically using a graph partitioning algorithm called Fixed Centered Partitioning first. Each cluster is represented by a coordinator node on the ring which implements various distributed mutual exclusion al...
متن کاملA Permission based Multilevel Parallel Solution for Distributed Mutual Exclusion
Due to the growing application of peer-to-peer computing, the distributed applications are continuously spreading over an extensive number of nodes. To cope with this large number of participants, various cluster based hierarchical solutions have been proposed. Cluster or group based solutions are scalable for a large number of participants. All of these solutions exploit the idea of coordinato...
متن کاملA Permission Based Hierarchical Algorithm for Mutual Exclusion
Due to the growing application of peer-to-peer computing, the distributed applications are continuously spreading over extensive number of nodes. To cope with this large number of participants, various cluster based hierarchical solutions have been proposed. Cluster based algorithms are scalable by nature. Several of them are quorum based solutions. All of these solutions exploit the idea of co...
متن کاملGroup Mutual Exclusion In Tree Networks
The group mutual exclusion (GME) problem deals with sharing a set of (m) mutually exclusive resources among all (n) processes of a network. Processes are allowed to be in a critical section simultaneously provided they request the same resource. We present three group mutual exclusion solutions for tree networks. All three solutions do not use process identifiers, and use bounded size messages....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Distributed and Parallel systems
سال: 2016
ISSN: 2229-3957,0976-9757
DOI: 10.5121/ijdps.2016.7102